Topological Content Delivery With Feedback and Random Receiver Cache

We study the problem of content delivery in two-user interference channels with altering topology, random available cache at receivers, and delayed channel knowledge transmitter. establish a new set outer-bounds on achievable rates when each receiver has access to fraction message intended for other receiver, transmitter is aware which part its own known unintended receiver. The reveal significant potential rate boost associated even small amount side-information key deriving bounds quantify baseline entropy that will always become given topology already side-information. also present matching certain scenarios outline challenges more general settings.